package dp.basics;
//343. 整数拆分
public class Num343_integerBreak {
    public int integerBreak(int n) {
        int []dp = new int[n + 1];//dp[i]表示拆分i之后得到的最大乘积
        dp[2] = 1;
        for (int i = 3; i <= n   ; i++) {
            for (int j = 1; j < i; j++) {
                dp[i] = Math.max(dp[i] , Math.max(j * dp[i - j] , j * (i - j)));
            }

        }
        return dp[n];


    }
}
